On the numerical solution of ill‐conditioned linear systems by regularization and iteration

We propose to reduce the (spectral) condition number of a given linear system by adding a suitable diagonal matrix to the system matrix, in particular by shifting its spectrum. Iterative procedures are then adopted to recover the solution of the original system. The case of real symmetric positive definite matrices is considered in particular, and several numerical examples are given. This approach has some close relations with Riley's method and with Tikhonov regularization. Moreover, we identify approximately the aforementioned procedure with a true action of preconditioning.     

基于视觉辐条图案识别方法的蓝宝石引晶机制研究

工业生产蓝宝石晶体过程中,引晶步骤有着至关重要的地位。引晶必须在温度梯度较小,温度分布趋于稳定的条件下进行。目前,工业生产蓝宝石主要依靠人工经验操控籽晶杆实现引晶操作,但是人工引晶操作的准确性不高会导致成品品质不佳、资源浪费。为此,本文提出一种基于蓝宝石视觉辐条图案识别方法来检测蓝宝石熔体状态自由液面状态,从而实现一种高效率引晶的机制。此方法利用经典骨架化算法细化辐条图案,Harris算子实现特征信息的提取,提取的特征信息放入运动轨迹模型中判断熔体稳定性,分析液面温度分布稳定性从而实现引晶。结果表明,此算法具有有效性,蓝宝石晶体引晶效率大大提高,生产出的成品良率也有提升,可有效指导蓝宝石的工业生产。     

Moderate Deviation for the Rightmost Position in a Branching Brownian Motion

We study the moderate deviation probability of the position of the rightmost particle in a branching Brownian motion and obtain its moderate deviation function. Firstly, Chauvin and Rouault studied the large deviation probability for the rightmost position in a branching Brownian motion. Recently, Derrida and Shiconsidered lower deviation for the same model. By contrast, Our main result is more extensive.     

Linear independence of a finite set of time-frequency shifts

This paper introduces an open conjecture in time-frequency analysis on the linear independence of a finite set of time-frequency shifts of a given L² function. Firstly, background and motivation for the conjecture are provided. Secondly, the main progress of this linear independence in the past twenty five years is reviewed. Finally, the partial results of the high dimensional case and other cases for the conjecture are briefly presented.     

An approach to characterization of the agricultural self-propelled machines stability

This paper presents an analytical algorithm with appropriate software specified for the approximation of the allowed critical slope of the solid flat terrain that guarantees static and/or dynamic stability of the specified self-propelled agricultural machines and their aggregates. This algorithm assumes machine as a rigid body, having 3 or 4 contact points (defined by wheels or crawlers), under uniform motion at different constant velocities and radii of curvature trajectories. Using this algorithm, based on the principles of theoretical mechanics combined with 3D analytical geometry, the computer program SSPM (stability of the self-propelled agricultural machines) has been coded. This software is intended to facilitate the analysis, comparison and optimization of different configurations of self-propelled agricultural machines in operation on horizontal and sloped flat terrains at constant velocities and radii of trajectory with respect to their static and dynamic stability. It calculates critical pitch and roll angles of the self-propelled machine and the maximum allowed slope of the flat terrain under the given conditions. The algorithm and the appropriate SSPM software were experimentally verified using the platform and low-scale tractor model. Average difference between calculated and experimental critical values of roll and pitch angles were about 4°